The HOMFLY-PT polynomial is fixed-parameter tractable
نویسنده
چکیده
Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter tractable in the treewidth of the link diagram, but the parameterised complexity of the more powerful HOMFLY-PT polynomial remained an open problem. Here we show that computing HOMFLY-PT is fixedparameter tractable in the treewidth, and we give the first sub-exponential time algorithm to compute it for arbitrary links.
منابع مشابه
The Reduced Homfly-pt Homology for the Conway and the Kinoshita-terasaka Knots
In this paper we compute the reduced HOMFLY-PT homologies of the Conway and the Kinoshita-Terasaka knots and show that they are isomorphic.
متن کاملHOMFLY-PT skein module of singular links in the three-sphere
For a ring R, we denote by R[L] the free R-module spanned by the isotopy classes of singular links in S. Given two invertible elements x, t ∈ R, the HOMFLY-PT skein module of singular links in S (relative to the triple (R, t, x)) is the quotient of R[L] by local relations, called skein relations, that involve t and x. We compute the HOMFLY-PT skein module of singular links for any R such that (...
متن کاملIntegral HOMFLY-PT and sl(n)-Link Homology
Using the diagrammatic calculus for Soergel bimodules, developed by Elias and Khovanov, as well as Rasmussen's spectral sequence, we construct an integral version of HOMFLY-PT and sln-link homology.
متن کاملHochschild homology of certain Soergel bimodules
The Soergel bimodules were introduced by Soergel in [9, 10] in the context of the infinite-dimensional representation theory of simple Lie algebra and Kazhdan-Lusztig theory. They have nice explicit expression as the tensor products of the rings of polynomials invariant under the action of a symmetric group, tensored over rings of the same form. Moreover, there are various quite different inter...
متن کاملParameterized Complexity and Kernel Bounds for Hard Planning Problems
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.05776 شماره
صفحات -
تاریخ انتشار 2017